Tolerance of scale-free networks against attack-induced cascades.
نویسندگان
چکیده
Scale-free networks can be disintegrated by attack on a single or a very few nodes through the process of cascading failures. By utilizing a prototype cascading model, we previously determined the critical value of the capacity parameter below which the network can become disintegrated due to attack on a single node. A fundamental question in network security, which has not been addressed previously but may be more important and of wider interest, is how to design networks of finite capacity that are safe against cascading breakdown. Here we derive an upper bound for the capacity parameter, above which the network is immune to cascading breakdown. Our theory also yields estimates for the maximally achievable network integrity via controlled removal of a small set of low-degree nodes. The theoretical results are confirmed numerically.
منابع مشابه
Enhancing the Scale-Free Network's Attack Tolerance
Despite the large size of most communication systems such as the Internet and World Wide Web (WWW), there is a relatively short path between two nodes, revealing the networks’ small world characteristic which speeds the delivery of information and data. While these networks have a surprising error tolerance, their scale-free topology makes them fragile under intentional attack, leaving us a cha...
متن کاملRobustness of Controllability for Networks Based on Edge-Attack
We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erdős-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustnes...
متن کاملEvolution of cooperation on scale-free networks subject to error and attack
We study the evolution of cooperation in the prisoner’s dilemma and the snowdrift game on scale-free networks that are subjected to intentional and random removal of vertices. We show that, irrespective of the game type, cooperation on scale-free networks is extremely robust against random deletion of vertices, but declines quickly if vertices with the maximal degree are targeted. In particular...
متن کاملEfficiency of Scale-Free Networks: Error and Attack Tolerance
The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e. networks with power law P(k), are considered: 1) scale-free networks with no local clustering produced by the Barabasi-Albert model and 2) scale-free networks ...
متن کاملSecuring AODV routing protocol against the black hole attack using Firefly algorithm
Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 72 2 Pt 2 شماره
صفحات -
تاریخ انتشار 2005